Double - Pullback Transitions
نویسندگان
چکیده
The aim of this paper is an extension of the theory of graph transformation systems in order to make them suitable for the speciication of reactive systems. For this purpose two main extensions of the algebraic theory of graph transformations are proposed. Firstly, graph transitions are introduced as a loose interpretation of graph productions, deened using a double pullback construction in contrast to classical graph derivations based on double-pushouts. Two characterisation results relate graph transitions to the classical double-pushout derivations and to amalgamated derivations, respectively. Secondly, a loose semantics for graph transformation systems is deened, which associates with each system a category of models (deterministic transition systems) deened as coalgebras over a suitable functor. Such category has a nal object, which includes all nite and innnite transition sequences. The coalgebraic framework makes it possible to introduce a general notion of a logic of behavioural constraints. Instances include start graphs, application and consistency conditions, and temporal logic constraints. We show that the considered semantics can be restricted to a nal coalgebra semantics for systems with behavioural constraints.
منابع مشابه
Loose Semantics and Constraints for GraphTransformation Systems ?
The main aim of this paper is an extension of the theory of algebraic graph transformation systems by a loose semantics. For this purpose, graph transitions are introduced as a loose interpretation of graph productions. They are deened using a double pullback construction in contrast to classical graph derivations based on double-pushouts. Two characterisation results relate graph transitions t...
متن کاملOn the Construction of Pullbacks for Safe Petri Nets
The product of safe Petri nets is a well known operation : it generalizes to concurrent systems the usual synchronous product of automata. In this paper, we consider a more general way of combining nets, called a pullback. The pullback operation generalizes the product to nets which interact both by synchronized transitions and/or by a shared sub-net (i.e. shared places and transitions). To obt...
متن کاملPullback D-attractors for non-autonomous partly dissipative reaction-diffusion equations in unbounded domains
At present paper, we establish the existence of pullback $mathcal{D}$-attractor for the process associated with non-autonomous partly dissipative reaction-diffusion equation in $L^2(mathbb{R}^n)times L^2(mathbb{R}^n)$. In order to do this, by energy equation method we show that the process, which possesses a pullback $mathcal{D}$-absorbing set, is pullback $widehat{D}_0$-asymptotically compact.
متن کاملCat$^1$-polygroups and pullback cat$^1$-polygroups
In this paper, we give the notions of crossed polymodule and cat$^1$-polygroup as a generalization of Loday's definition. Then, we define the pullback cat$^1$-polygroup and we obtain some results in this respect. Specially, we prove that by a pullback cat$^1$-polygroup we can obtain a cat$^1$-group.
متن کاملParallel rewriting of graphs through the pullback approach
We continue here the development of our description of the pullback approach to graph rewriting-already shown to encompass both the NCE and the double-pushout approach, by describing parallel application of rewriting rules. We show that this new framework provides a genuine deenition of parallel rewriting (parallel application of several rewriting rules at several diierent places in the graph i...
متن کامل